Optimal Coverage Algorithm of Wireless Sensor Networks Based on Particle Swarm Optimization with Coherent Velocity
نویسندگان
چکیده
Optimal coverage of wireless sensor networks is one of the most fundamental problems for constructing efficient perception layer of the Internet of Things. On the basis of research on spatial neighborhood, the node coverage and area coverage models are analyzed, then an optimal coverage algorithm of wireless sensor networks is proposed based on particle swarm optimization with coherent velocity. Experimental results show that the algorithm can significantly improve the network coverage; in addition, the coherent velocity can effectively avoid network prematurely into a local optimal solution, so as to enhance the network coverage.
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملIntelligent Single Particle Optimizer Based Wireless Sensor Networks Adaptive Coverage
This paper studies wireless sensor networks node deployment problem and proposes intelligent single particle optimizer based wireless sensor networks adaptive coverage. According to the probability model measure characteristic of wireless sensor nodes, the method adaptively determines the optimal deployment of sensor nodes using intelligent single particle optimizer, achieving sensor node based...
متن کاملMulti-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملAn Improved Co-evolutionary Particle Swarm Optimization for Wireless Sensor Networks with Dynamic Deployment
The effectiveness of wireless sensor networks (WSNs) depends on the coverage and target detection probability provided by dynamic deployment, which is usually supported by the virtual force (VF) algorithm. However, in the VF algorithm, the virtual force exerted by stationary sensor nodes will hinder the movement of mobile sensor nodes. Particle swarm optimization (PSO) is introduced as another ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016